DMA completion mechanism

ABSTRACT

A method, an apparatus, and a computer program product are provided for completing a plurality of (direct memory access) DMA commands in a computer system. It is determined whether the DMA commands are chained together as a list DMA command. Upon a determination that the DMA commands are chained together as a list DMA command, it is also determined whether a current list element of the list DMA command is fenced. Upon a determination that the current list element is not fenced, a next list element is fetched and processed before the current list element has been completed.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention relates generally to a computer system and, more particularly, to handling and completing direct memory access (DMA) commands.

2. Description of the Related Art

There are many methods to complete direct memory access (DMA) commands. Perhaps the simplest method is to have a counter that tracks the transfer size. When the size is zero, the DMA command can be completed. For complex DMA transfers, however, this method may not work well. For example, some DMA transfers should be completed before subsequent DMA transfers are initiated. Other DMA transfers do not have to be completed before subsequent DMA transfers are initiated.

Therefore, a need exists for reducing the latency in completing a DMA task, by optimizing the DMA transfers depending on the type of DMA commands.

SUMMARY OF THE INVENTION

The present invention provides a method, an apparatus, and a computer program product for completing a plurality of (direct memory access) DMA commands in a computer system. It is determined whether the DMA commands are chained together as a list DMA command. Upon a determination that the DMA commands are chained together as a list DMA command, it is also determined whether a current list element of the list DMA command is fenced. Upon a determination that the current list element is not fenced, a next list element is fetched and processed before the current list element has been completed.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:

FIG. 1 depicts a block diagram illustrating a direct memory access (DMA) completion mechanism in a computer system having a main processing unit (MPU);

FIG. 2 depicts a block diagram illustrating a DMA completion mechanism in a computer system having two or more processing units; and

FIG. 3 depicts a flow diagram illustrating a DMA completion mechanism.

DETAILED DESCRIPTION

In the following discussion, numerous specific details are set forth to provide a thorough understanding of the present invention. However, those skilled in the art will appreciate that the present invention may be practiced without such specific details. In other instances, well-known elements have been illustrated in schematic or block diagram form in order not to obscure the present invention in unnecessary detail. Additionally, for the most part, details concerning network communications, electromagnetic signaling techniques, and the like, have been omitted inasmuch as such details are not considered necessary to obtain a complete understanding of the present invention, and are considered to be within the understanding of persons of ordinary skill in the relevant art.

In the remainder of this description, a processing unit (PU) may be a sole processor of computations in a device. In such a situation, the PU is typically referred to as an MPU (main processing unit). The processing unit may also be one of many processing units that share the computational load according to some methodology or algorithm developed for a given computational device. For the remainder of this description, all references to processors shall use the term MPU whether the MPU is the sole computational element in the device or whether the MPU is sharing the computational element with other MPUS, unless indicated otherwise.

It is further noted that, unless indicated otherwise, all functions described herein may be performed in either hardware or software, or some combination thereof. In a preferred embodiment, however, the functions are performed by a processor such as a computer or an electronic data processor in accordance with code such as computer program code, software, and/or integrated circuits that are coded to perform such functions, unless indicated otherwise.

For a complex direct memory access (DMA) transfer, a plurality of DMA commands can be chained together as a single DMA command called a “list DMA command.” Each of the DMA commands contained in a list DMA command is called a list element. A list DMA command may contain a pointer to a first list element included in the list DMA command. The list elements in the list DMA command may be fenced or non-fenced. If the list element is fenced, then it must be completed by a bus before the next list element can be fetched and proceed.

However, at times, it is desirable to proceed to the next list element before the current list element has been completed (i.e., a bus that takes care of the list element has returned data requested to be fetched in the list element) if the current list element is not fenced. In this case, after the current list element has finished “unrolling” one or more requests to the bus, the DMA engine can start processing the next list element before the current list element is completed on the bus. Since the latencies on the bus vary depending on the workload type, it is possible that the completion of the current list element can take a long time.

Now referring to FIG. 1 of the drawings, the reference numeral 100 generally designates a block diagram illustrating a portion of a computer system related to DMA transfers. The block diagram 100 comprises a main processing unit (MPU) 102, a direct memory access controller (DMAC) 104, and a bus interface unit 106. The MPU 102 includes a local storage 108 such as a level 1 (L1) cache. The DMAC 104 includes an issue logic 110, a DMA command queue (DMAQ) 112, a request interface logic (RIL) 114, and a DMA completion logic (DCL) 116. The DMA completion logic includes a local memory (LM) 118 such as a register file. The MPU 102 is coupled to the DMAC 104 via a connection 120. The DMAC 104 is coupled to the bus interface unit 106 via a connection 122. Specifically, the issue logic 110 is coupled to the DMAQ 112, the DCL 116, and the RIL 114 via connections 124, 126, and 128, respectively. The RIL 114 is coupled to the DMAQ 112 and the DCL 116 via connections 130 and 132, respectively.

The DCL 116 contains information as to whether the current list element is fenced. Preferably, this information is stored in the LM 118 and stores a table including indications of completion count, list, stall/fence, and finish. The issue logic 110 is configured for issuing a DMA unroll request and is coupled to the DCL 116 for receiving a stall notification from the DCL 116. The DMA command queue (DMAQ) is configured for temporarily storing the DMA command and is coupled to the issue logic 110 for receiving the DMA unroll request. The request interface logic (RIL) 114 is coupled to the DMAQ, the issue logic, and the DCL. The RIL is configured for processing at least one segment of the DMA command.

The MPU 102 generates a DMA command, which is transferred to the DMAC 104 via the connection 120. The transferred DMA command is temporarily held at the DMAQ 112. Preferably, the DMA command is initially stored in the local storage 108, and the MPU 102 is configured for sending a control signal to the DMAC 104 to inform the DMAC 104 that the DMA command is available from the local storage 108. Such a control signal may also include information as to the properties of the DMA command. The information may include, for example, the type of the DMA command (e.g., whether the DMA command is a list DMA command and, if so, whether list elements in the list DMA command are fenced or not fenced).

The DMA command is preferably fetched by the issue logic 110. Based on the information received from the MPU 102, the issue logic 110 fetches the DMA command from the local storage 108 and places the DMA command in the DMAQ 112. The DMAQ 112 temporarily holds multiple DMA commands (or multiple list elements in the case of multiple list DMA commands) before they are sent out to the bus interface unit 106. Preferably, the request interface logic 114 accesses the DMAQ 112 to retrieve a DMA command (or a list element in the case of a list DMA command) from the DMAQ 112. This retrieved DMA command is then provided to the bus interface unit 106 via the connection 122. As mentioned above, this process involves “unrolling” one or more requests to the bus interface unit 106.

In the case of a list DMA command, the DCL 116 determines when the DMAC 104 can start processing the next list DMA command in the DMAQ 112. If list elements of the list DMA command are fenced, then the DMAC 104 has to wait for the prior list DMA command to be completed, for example, on a bus (not shown). If the list elements are not fenced, the DMAC 104 does not have to wait for the prior DMA list element to be completed before starting to process the next list element. The LM 118 is configured to store information used to determine whether the DMAC 104 should wait for the prior DMA list element to be completed before starting to process the next list element.

Such information includes, but may not be limited to, (a) the status of a DMA command already sent to the bus interface unit, (b) the properties of a DMA command (e.g., whether it is a list DMA command, and if so, whether the list elements of the list DMA command are fenced or not fenced), and (c) an indication of the last request of a DMA command being issued to the bus. Preferably, the LM 118 is configured to store a table that contains the following bits for the DMAQ 112: one or more completion count bits, a list bit, a stall/fence bit, and a finish bit.

The number of completion count bits is dependent on the size of a buffer (not shown) in the bus interface unit 106. This value is incremented when requests are issued to the bus and decremented when the bus completes a request. For instance, if the number of queue entries is 16, then the completion count is 5 bits.

The list bit is set if the command that is queued is a list DMA command. This bit is reset when the last transfer/unroll of the last list element has been issued to the bus. For example, if the size of the list DMA command is five (i.e., there are five list elements in the list DMA command), the list bit is set when the command is queued and reset on the last transfer to the bus of the fifth list element.

The stall/fence bit is set if the current list element is fenced. When this bit is set, the list element must wait for all bus completions to take place, send a stall notification condition and wait for the stall acknowledgement before the next list element can be processed. This bit is reset when the current list element with fenced/stall condition is acknowledged by the MPU 102.

The finish bit is set when the last unroll/request for the current DMA command has been issued to the bus. In the case of a list DMA command, this bit is set when the last unroll or request for the list element has been issued. This bit is reset when a new command is enqueued into the DMA queue entry, when a stall notification has been sent, or when a new list element is fetched.

When a list element is fetched and enqueued, the list bit and stall/fence bit in the DCL 116 are updated. For non-list DMA commands, these fields are always zero. When a DMA request is issued out to the bus, the completion count in the completion logic is incremented by one. Later, the bus will provide a completion for that DMA request, and the completion logic will decrement the completion count by one. On the last request of the current DMA command (or last list element), the finish bit in the DCL 116 will be set.

Now referring to FIG. 2, a block diagram 200 shows a portion of a computer system, where there exist two processors, namely, a synergistic processing unit (SPU) 202 and a processing unit (PU) 204. The computer system also has a DMAC 205 and a bus interface unit (BIU) 206. The SPU 202 includes a local storage 208 for storing a plurality of DMA commands. The SPU 202 is coupled to the DMAC 205 via a connection 210. Similarly, the PU 204 is coupled to the DMAC 205 via a connection 212. The DMAC 205 is coupled to the BIU 206 via a connection 214. The DMAC 205 is similar to the DMAC 104 of FIG. 1, except that the DMAC 205 has a DMAQ 216 and an LM 218 instead of the DMAQ 112 and the LM 118 of FIG. 1. The DMAQ 216 is configured to house DMA commands sourced from both the SPU 202 and the PU 204. The LM 218 is configured to store first and second tables (not shown) corresponding to the SPU 202 and the PU 204, respectively.

Preferably, the LM 218 is configured to store a table that contains the following bits for the DMAQ 216: one or more completion count bits, a list bit, a stall/fence bit, and a finish bit. The properties of these bits are as illustrated above in reference to FIG. 1.

Similarly, the LM 218 is also configured to store the second table that contains the following bits for the DMAQ 216: one or more completion count bits, a start bit, and a finish bit. The start bit is sent to start the SPU 202 after the DMA command has been completed. This bit is set when the command is enqueued. There is no requirement to reset this bit since every time a DMA command is enqueued, the value of this bit will be written with a new value.

It is noted here that the present invention may be implemented in a computer system further including additional processor(s) in a similar fashion without departing from the spirit of the present invention.

In FIG. 3, a flow diagram 300 is shown to illustrate a DMA completion mechanism. In step 302, a current DMA command is unrolled. The process of unrolling the current DMA command includes generating one or more requests from the current DMA command and sending the requests to a bus, for example, through the BIU 206 of FIG. 2. Preferably, a DMA command may include up to 128 requests, each of which may be of the size of a cache line. The process of unrolling in step 302 is complete when all the requests arising out of the current DMA command are sent to the bus.

In step 304, it is determined whether the current DMA command is a list element of a list DMA command. If the current DMA command is a list element of a list DMA command, which list element is now considered a current list element, it is further determined in step 306 whether the current list element is fenced.

If the current list element is not fenced, the process goes to step 308 to determine whether the current list element is the last list element of the list DMA command. If on the other hand the current: list element is fenced, the process goes to step 310 to wait for all the requests in the current DMA command to be completed. When the last request for the last list element has been sent to the bus, the list bit will be reset to ‘0’. The completion of the list DMA command occurs when completion count=0, finish=1, and stall/fence=0. If the current list element is fenced, the DMAC will wait until the completion count=0 (stall/fence=1, finish =1) and notify a processor (e.g., the MPU 102 of FIG. 1 or the SPU 202 of FIG. 2) that the current list element is stalled. The finish bit is reset after the notification of the list element. The stall/fence bit does not need to be reset since the next list element will write in a new value.

If it is determined in step 308 that the current list element is not the last list element of the list DMA command, then the process goes to step 312 to fetch a next list element and then returns to step 302. Preferably after step 310, a stall notification is sent and a stall acknowledgement is received in step 314. In reference to FIG. 1, for example, the DMAC 104 sends the stall notification to the MPU 102 and receives the stall acknowledgement from the MPU 102. Alternatively, step 314 may come before step 310 depending on the detailed implementation of a specific DMA completion mechanism.

If it is determined in step 308 that the current list element is the last list element of the list DMA command, the process goes to step 316 to complete the current DMA command after all completions have been received. Subsequently, the process ends. For list DMA commands, when the last transfer of the list element is issued to the bus, the finish bit is set to ‘1’. A request will be made to fetch the last list element. If the stall/fence bit is active, then the list fetch request is cancelled. However, if the stall/fence is not set, the next list element is fetched. For non-list DMA commands, completion occurs when completion count=0, finish=1, list=0, and stall/fence=0. If start bit=1 for the PU 204 of FIG. 2 at the time of completion, a start command is sent to the SPU 202 of FIG. 2.

If in step 304 it is determined that the current DMA command is not a list element of a list DMA command, the process goes to step 316 to complete the current DMA command after all completions have been received. Subsequently, the process ends.

Subsequently after step 314, it is determined in step 318 whether the current list element is the last list element. If the current list element is the last list element, then the process ends. If on the other hand the current list element is not the last list element, the process goes to step 312 to fetch a next list element and then returns to step 302.

It will be understood from the foregoing description that various modifications and changes may be made in the preferred embodiment of the present invention without departing from its true spirit. This description is intended for purposes of illustration only and should not be construed in a limiting sense. The scope of this invention should be limited only by the language of the following claims. 

1. A method for completing a plurality of (direct memory access) DMA commands in a computer system, the method comprising the steps of: determining whether the DMA commands are chained together as a list DMA command; upon a determination that the DMA commands are chained together as a list DMA command, determining whether a current list element of the list DMA command is fenced; and upon a determination that the current list element is not fenced, fetching and processing a next list element before the current list element has been completed.
 2. The method of claim 1, further comprising the step of, upon a determination that the current list element is fenced, fetching and processing the next list element after the current list element has been completed.
 3. The method of claim 1, wherein the computer system includes at least one processor having a local storage, the method further comprising the step of generating a table including indications of completion count, list, stall/fence, and finish.
 4. The method of claim 1, wherein the computer system includes a synergistic processing unit (SPU) and a processing unit (PU), the method further comprising the steps of: generating an SPU table including indications of completion count, list, stall/fence, and finish; and generating a PU table including indications of completion count, start, and finish.
 5. The method of claim 3, wherein the completion count is incremented when requests are issued to a bus in the computer system and is decremented when the bus completes a request.
 6. The method of claim 3, wherein the indication of list comprises one bit, which is set if the DMA commands constitute a list DMA command and reset when a last transfer/unroll of a last DMA command has been issued to a bus of the computer system.
 7. The method of claim 3, wherein the indication of stall/fence comprises one bit, which is set if the current list element is fenced and reset when the current list element with fenced/stall condition is acknowledged by the at least one processor.
 8. The method of claim 3, wherein the indication of finish comprises one bit, which is set when a last request for a DMA command has been issued and reset when a new command is fetched to a direct memory access controller (DMAC) of the computer system.
 9. The method of claim 4, wherein the completion count is incremented when requests are issued to a bus in the computer system and decremented when the bus completes a request.
 10. The method of claim 4, wherein the indication of list comprises one bit, which is set if the DMA commands constitute a list DMA command and reset when a last transfer/unroll of a last DMA command has been issued to a bus of the computer system.
 11. The method of claim 4, wherein the indication of stall/fence comprises one bit, which is set if the current list element is fenced and reset when the current list element with fenced/stall condition is acknowledged by the SPU.
 12. The method of claim 4, wherein the indication of start comprises one bit, which is set when a DMA command is fetched to a direct memory access controller (DMAC) of the computer system.
 13. The method of claim 4, wherein the indication of finish comprises one bit, which is set when a last request for a DMA command has been issued and reset when a new command is fetched to a direct memory access controller (DMAC) of the computer system.
 14. An apparatus for completing a plurality of (direct memory access) DMA commands in a computer system, the apparatus comprising: means for determining whether the DMA commands are chained together as a list DMA command; means for, upon a determination that the DMA commands are chained together as a list DMA command, determining whether a current list element of the list DMA command is fenced; and means for, upon a determination that the current list element is not fenced, fetching and processing a next list element before the current list element has been completed.
 15. The apparatus of claim 14, further comprising means for, upon a determination that the current list element is fenced, fetching and processing the next list element after the current list element has been completed.
 16. The apparatus of claim 14, wherein the computer system includes at least one processor having a local storage, the apparatus further comprising means for generating a table including indications of completion count, list, stall/fence, and finish.
 17. The apparatus of claim 14, wherein the computer system includes a synergistic processing unit (SPU) and a processing unit (PU), the apparatus further comprising: means for generating an SPU table including indications of completion count, list, stall/fence, and finish; and means for generating a PU table including indications of completion count, start, and finish.
 18. The apparatus of claim 16, wherein the completion count is incremented when requests are issued to a bus in the computer system and decremented when the bus completes a request.
 19. The apparatus of claim 16, wherein the indication of list comprises one bit, which is set if the DMA commands constitute a list DMA command and reset when a last transfer/unroll of a last DMA command has been issued to a bus of the computer system.
 20. The apparatus of claim 16, wherein the indication of stall/fence comprises one bit, which is set if the current list element is fenced and reset when the current list element with fenced/stall condition is acknowledged by the at least one processor.
 21. The apparatus of claim 16, wherein the indication of finish comprises one bit, which is set when a last request for a DMA command has been issued and reset when a new command is fetched to a direct memory access controller (DMAC) of the computer system.
 22. The apparatus of claim 17, wherein the completion count is incremented when requests are issued to a bus in the computer system and decremented when the bus completes a request.
 23. The apparatus of claim 17, wherein the indication of list comprises one bit, which is set if the DMA commands constitute a list DMA command and reset when a last transfer/unroll of a last DMA command has been issued to a bus of the computer system.
 24. The apparatus of claim 17, wherein the indication of stall/fence comprises one bit, which is set if the current list element is fenced and reset when the current list element with fenced/stall condition is acknowledged by the SPU.
 25. The apparatus of claim 17, wherein the indication of start comprises one bit, which is set when a DMA command is fetched to a direct memory access controller (DMAC) of the computer system.
 26. The apparatus of claim 17, wherein the indication of finish comprises one bit, which is set when a last request for a DMA command has been issued and reset when a new command is fetched to a direct memory access controller (DMAC) of the computer system.
 27. A computer program product for completing a plurality of (direct memory access) DMA commands in a computer system, the computer program product having a medium with a computer program embodied thereon, the computer program comprising: computer program code for determining whether the DMA commands are chained together as a list DMA command; computer program code for, upon a determination that the DMA commands are chained together as a list DMA command, determining whether a current list element of the list DMA command is fenced; and computer program code for, upon a determination that the current list element is not fenced, fetching and processing a next list element before the current list element has been completed.
 28. The computer program product of claim 27, further comprising computer program code for, upon a determination that the current list element is fenced, fetching and processing the next list element after the current list element has been completed.
 29. The computer program product of claim 27, wherein the computer system includes at least one processor having a local storage, the computer program further comprising computer program code for generating a table including indications of completion count, list, stall/fence, and finish.
 30. The computer program product of claim 27, wherein the computer system includes a synergistic processing unit (SPU) and a processing unit (PU), the computer program further comprising: computer program code for generating an SPU table including indications of completion count, list, stall/fence, and finish; and computer program code for generating a PU table including indications of completion count, start, and finish.
 31. The computer program product of claim 29, wherein the completion count is incremented when requests are issued to a bus in the computer system and decremented when the bus completes a request.
 32. The computer program product of claim 29, wherein the indication of list comprises one bit, which is set if the DMA commands constitute a list DMA command and reset when a last transfer/unroll of a last DMA command has been issued to a bus of the computer system.
 33. The computer program product of claim 29, wherein the indication of stall/fence comprises one bit, which is set if the current list element is fenced and reset when the current list element with fenced/stall condition is acknowledged by the at least one processor.
 34. The computer program product of claim 29, wherein the indication of finish comprises one bit, which is set when a last request for a DMA command has been issued and reset when a new command is fetched to a direct memory access controller (DMAC) of the computer system.
 35. The computer program product of claim 30, wherein the completion count is incremented when requests are issued to a bus in the computer system and decremented when the bus completes a request.
 36. The computer program product of claim 30, wherein the indication of list comprises one bit, which is set if the DMA commands constitute a list DMA command and reset when a last transfer/unroll of a last DMA command has been issued to a bus of the computer system.
 37. The computer program product of claim 30, wherein the indication of stall/fence comprises one bit, which is set if the current list element is fenced and reset when the current list element with fenced/stall condition is acknowledged by the SPU.
 38. The computer program product of claim 30, wherein the indication of start comprises one bit, which is set when a DMA command is fetched to a direct memory access controller (DMAC) of the computer system.
 39. The computer program product of claim 30, wherein the indication of finish comprises one bit, which is set when a last request for a DMA command has been issued and reset when a new command is fetched to a direct memory access controller (DMAC) of the computer system.
 40. A computer system, comprising: at least one processor having a local storage for storing at least one (direct memory access) DMA command as a list element of a list DMA command; and a direct memory access controller (DMAC) coupled to the at least one processor for fetching a current list element from the local storage, the DMAC comprising a DMA completion logic (DCL) containing information as to whether the current list element is fenced, the DMAC being configured for fetching and processing a next list element from the local storage before the current list element has been completed when the current list element is not fenced.
 41. The computer system of claim 40, wherein the local storage is a level one (L1) cache.
 42. The computer system of claim 40, the DMAC further comprising: an issue logic configured for issuing a DMA unroll request and coupled to the DCL for receiving a stall notification from the DCL; a DMA command queue (DMAQ) configured for temporarily storing the at least one DMA command and coupled to the issue logic for receiving the DMA unroll request; and a request interface logic (RIL) coupled to the DMAQ, the issue logic, and the DCL, the RIL being configured for processing at least one segment of the at least one DMA command.
 43. The computer system of claim 40, further comprising a bus interface unit (BIU) coupled to the DMAC for receiving at least one segment of the at least one DMA command from the DMAC.
 44. The computer system of claim 40, wherein the DCL stores a table including indications of completion count, list, stall/fence, and finish.
 45. The computer system of claim 40, further comprising a second processor coupled to the DMAC.
 46. The computer system of claim 45, wherein the DCL contains a second table corresponding to the second processor, the second table including indications of completion count, start, and finish. 